Low degree minimal generators of phylogenetic semigroups
نویسندگان
چکیده
منابع مشابه
Generators of Detailed Balance Quantum Markov Semigroups
For a quantum Markov semigroup T on the algebra B(h) with a faithful invariant state ρ, we can define an adjoint T̃ with respect to the scalar product determined by ρ. In this paper, we solve the open problems of characterising adjoints T̃ that are also a quantum Markov semigroup and satisfy the detailed balance condition in terms of the operators H,Lk in the Gorini Kossakowski Sudarshan Lindblad...
متن کاملMatrix Transformations and Generators of Analytic Semigroups
In this paper, we are interested in the study of operators represented by infinite matrices. Note that in [1], Altay and Başar gave some results on the fine spectrum of the difference operator Δ acting on the sequence spaces c0 and c. Then they dealt with the fine spectrum of the operator B(r,s) defined by a matrix band over the sequence spaces c0 and c. In de Malafosse [3, 5], there are result...
متن کاملCores for generators of some Markov semigroups ∗
We consider a stochastic differential equation on Rd with Lipschitz coefficients. We find a core for the infinitesimal generator of the corresponding Markov process. Some applications, in particular, to well-posedness of Fokker–Planck equations are given. 2000 Mathematics Subject Classification AMS: 60H10, 60J35, 47D07.
متن کاملMinimal E0–semigroups
It is known that every semigroup of normal completely positive maps of a von Neumann can be “dilated” in a particular way to an E0-semigroup acting on a larger von Neumann algebra. The E0-semigroup is not uniquely determined by the completely positive semigroup; however, it is unique (up to conjugacy) provided that certain conditions of minimality are met. Minimality is a subtle property, and i...
متن کاملPseudorandom Generators for Low Degree Polynomials from Algebraic Geometry Codes
Constructing pseudorandom generators for low degree polynomials has received a considerable attention in the past decade. Viola [CC 2009], following an exciting line of research, constructed a pseudorandom generator for degree d polynomials in n variables, over any prime field. The seed length used is O(d log n + d2d), and thus this construction yields a non-trivial result only for d = O(log n)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Mathematics
سال: 2014
ISSN: 2199-675X,2199-6768
DOI: 10.1007/s40879-014-0011-7